Approximation Algorithms for Time Constrained Scheduling

Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

Many real-world problems require graphs of such large size that polynomial time algorithms are too costly as soon as their runtime is superlinear. Examples include problems in VLSI-design or problems in bioinformatics. For such problems the question arises: What is the best solution that can be obtained in linear time? We survey linear time approximation algorithms for some classical problems f...

Polynomial time approximation algorithms for machine scheduling: Ten open problems

We discuss what we consider to be the ten most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Prologue In the early days of scheduling, the work of the theoretical research branch mainly consist...

Approximation Algorithms for Constrained Knapsack Problems

We study constrained versions of the knapsack problem in which dependencies between items are given by a graph. In one version, an item can be selected only if one of its neighbours is also selected. In the other version, an item can be selected only when all its neighbours are also selected. These problems generalize and unify several problems including the prize collecting and budgeted maximu...

Approximation Algorithms for Budget-Constrained Auctions

Approximation Algorithms for Multiprocessor Scheduling Problem

In this paper, we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (≥ 1) identical processors connected by a complete network. The objective of this survey is to give a panoramic view of theoretical and/or practical approaches for solving the problem, that have been extensively conducted during the past three decades. key words: multipr...